Toward global solution to MAP image restoration and segmentation: using common structure of local minima
نویسنده
چکیده
In this paper, an iterative optimization algorithm, called the Comb algorithm, is presented for approximating the global solution to MAP image restoration and segementation. The Comb derives new initial conngurations based on the best local minimum found so far and leads a local search towards the global minimum. Experimental comparisons show that the Comb produces solutions of quality comparable to simulated annealing.
منابع مشابه
Toward Global Solution to MAP Image Estimation: Using Common Structure of Local Solutions
The maximum a posteriori (MAP) principle is often used in image restoration and segmentation to deene the optimal solution when both the prior and likelihood distributions are available. MAP estimation is equivalent to minimizing an energy function. It is desirable to nd the global minimum. However, the minimization in the MAP image estimation is non-trivial due to the use of contextual constra...
متن کاملCluster-Based Image Segmentation Using Fuzzy Markov Random Field
Image segmentation is an important task in image processing and computer vision which attract many researchers attention. There are a couple of information sets pixels in an image: statistical and structural information which refer to the feature value of pixel data and local correlation of pixel data, respectively. Markov random field (MRF) is a tool for modeling statistical and structural inf...
متن کاملمدلسازی صفحهای محیطهای داخلی با استفاده از تصاویر RGB-D
In robotic applications and especially 3D map generation of indoor environments, analyzing RGB-D images have become a key problem. The mapping problem is one of the most important problems in creating autonomous mobile robots. Autonomous mobile robots are used in mine excavation, rescue missions in collapsed buildings and even planets’ exploration. Furthermore, indoor mapping is beneficial in f...
متن کاملInvestigation of Parallel and Globally Convergent Iterative Schemes for Nonlinear Variational Image Smoothing and Segmentation
We consider a non{quadratic convex variational seg-mentation approach and investigate numerical schemes to allow for an eecient computation of the global minimum on a parallel architecture. We focus on iterative schemes for which we can show global convergence to the unique solution irrespective of the starting point. In the context of (semi{)automated image processing tasks, such a feature is ...
متن کاملNew Pseudo-CT Generation Approach from Magnetic Resonance Imaging using a Local Texture Descriptor
Background: One of the challenges of PET/MRI combined systems is to derive an attenuation map to correct the PET image. For that, the pseudo-CT image could be used to correct the attenuation. Until now, most existing scientific researches construct this pseudo-CT image using the registration techniques. However, these techniques suffer from the local minima of the non-rigid deformation energy f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 33 شماره
صفحات -
تاریخ انتشار 2000